XBF: Scaling up Bloom-filter-based Source Routing

نویسندگان

  • Markku Antikainen
  • Liang Wang
  • Dirk Trossen
  • Arjuna Sathiaseelan
چکیده

A well known drawback of IP-multicast is that it requires per-group state to be stored in the routers. Bloom-filter based source-routed multicast remedies this problem by moving the state from the routers to the packets. However, a fixed sized Bloom-filter can only store a limited number of items before the false positive ratio grows too high implying scalability issues. Several proposals have tried to address these scalability issues in Bloom-filter forwarding. These proposals, however, unnecessarily increase the forwarding complexity. In this paper, we present Extensible-Bloom-filter (XBF), a new framing and forwarding solution which effectively circumvents the aforementioned drawbacks. XBF partitions a network into sub-networks that reflect the network topology and traffic patterns, and uses a separate fixed-length Bloomfilter in each of these. We formulate this partition assignment problem into a balanced edge partitioning problem, and evaluate it with simulations on realistic topologies. Our results show that XBF scales to very large networks with minimal overhead and completely eliminate the false-positives that have plagued the traditional Bloom-filter-based forwarding protocols. It furthermore integrates with SDN environments, making it highly suitable for deployments in off-the-shelf SDN-based networks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Feasibility of Gradient-based Routing Mechanisms Using Bloom Filters

Gradient-based routing using Bloom filters is an effective mechanism to enable data-driven queries in multi-hop networks. A node compressively describes its data items as a Bloom filter, which is then diffused away to the other nodes with information decay. The Bloom filters form an information potential that eventually navigates queries to the source node by ascending the potential field. The ...

متن کامل

HR-SDBF: an approach to data-centric routing in WSNs

In existing query-based routing protocols in wireless sensor networks (WSNs), a node either keeps precise route information to desired events, such as in event flooding, or does not keep any route to desired events, such as in query flooding. In this paper, we propose a routing protocol, called hint-based routing by scope decay bloom filter (HR-SDBF), that employs probabilistic hints. In the HR...

متن کامل

Scalable Downward Routing for Wireless Sensor Networks and Internet of Things Actuation

In this paper, we study the downward routing for network control/actuation in large-scale and heterogeneous wireless sensor networks (WSNs) and Internet of Things (IoT). We propose the Opportunistic Source Routing (OSR), a scalable and reliable downward routing protocol for WSNs/IoT. OSR introduces opportunistic routing into traditional source routing based on the parent set of a node’s upward ...

متن کامل

BloomCasting: Security in Bloom Filter Based Multicast

Traditional multicasting techniques give senders and receivers little control for who can receive or send to the group and enable end hosts to attack the multicast infrastructure by creating large amounts of group specific state. Bloom filter based multicast has been proposed as a solution to scaling multicast to large number of groups. In this paper, we study the security of multicast built on...

متن کامل

Routing on large scale mobile ad hoc networks using bloom filters

A bloom filter is a probabilistic data structure used to test whether an element is a member of a set. The bloom filter shares some similarities to a standard hash table but has a higher storage efficiency. As a drawback, bloom filters allow the existence of false positives. These properties make bloom filters a suitable candidate for storing topological information in large-scale mobile ad hoc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1602.05853  شماره 

صفحات  -

تاریخ انتشار 2016